Uniform asymptotics for the linearized Boltzmann equation describing sound wave propagation

The multiple-scale expansionmethod is used for constructing a uniformly applicable asymptotic approximation of the solution of the linearized Boltzmann equation for small Knudsen numbers. The asymptotic expansion is constructed for the particular example of a sound wave generated by a plane oscillation source and dissipating in a half-space. The simplicity of the problem makes it possible clearly to demonstrate the appearance of secular terms in the expansion and the introduction of multiple scales opens the way to eliminating them.     

Elliptic Solutions of Dynamical Lucas Sequences

We study two types of dynamical extensions of Lucas sequences and give elliptic solutions for them. The first type concerns a level-dependent (or discrete time-dependent) version involving commuting variables. We show that a nice solution for this system is given by elliptic numbers. The second type involves a non-commutative version of Lucas sequences which defines the non-commutative (or abstract) Fibonacci polynomials introduced by Johann Cigler. If the non-commuting variables are specialized to be elliptic-commuting variables the abstract Fibonacci polynomials become non-commutative elliptic Fibonacci polynomials. Some properties we derive for these include their explicit expansion in terms of normalized monomials and a non-commutative elliptic Euler–Cassini identity.     

The size Ramsey number of short subdivisions of bounded degree graphs

For graphs G and F, write if any coloring of the edges of G with colors yields a monochromatic copy of the graph F. Suppose is obtained from a graph S with s vertices and maximum degree d by subdividing its edges h times (that is, by replacing the edges of S by paths of length h + 1). We prove that there exists a graph G with no more than edges for which holds, provided that . We also extend this result to the case in which Q is a graph with maximum degree d on q vertices with the property that every pair of vertices of degree greater than 2 are distance at least h + 1 apart. This complements work of Pak regarding the size Ramsey number of “long subdivisions” of bounded degree graphs.     

On the role of kinesthetic thinking in computational geometry

Computational geometry is a new (about 30 years) and rapidly growing branch of knowledge in computer science that deals with the analysis and design of algorithms for solving geometric problems. These problems typically arise in computer graphics, image processing, computer vision, robotics, manufacturing, knot theory, polymer physics and molecular biology. Since its inception many of the algorithms proposed for solving geometric problems, published in the literature, have been found to be incorrect. These incorrect algorithms rather than being ‘purely mathematical’ often contain a strong kinesthetic component. This paper explores the relationship between computational geometric thinking and kinesthetic thinking, the effect of the latter on the correctness and efficiency of the resulting algorithms, and their implications for education.     

Evaluation of mean and variance integrals without integration

The mean and variance of some continuous distributions, in particular the exponentially decreasing probability distribution and the normal distribution, are considered. Since they involve integration by parts, many students do not feel comfortable. In this note, a technique is demonstrated for deriving mean and variance through differential calculus. The general nature of the technique has potential for wider applications.     

Gutmann's Donor Numbers Correctly Assess the Effect of the Solvent on the Kinetics of SNAr Reactions in Ionic Liquids

We report an experimental study on the effect of solvents on the model S_NAr reaction between 1‐chloro‐2,4‐dinitrobenzene and morpholine in a series of pure ionic liquids (IL). A significant catalytic effect is observed with reference to the same reaction run in water, acetonitrile, and other conventional solvents. The series of IL considered include the anions, NTf₂^?, DCN^?, SCN^?, CF₃SO₃^?, PF₆^?, and FAP^? with the series of cations 1‐butyl‐3‐methyl‐imidazolium ([BMIM]⁺), 1‐ethyl‐3‐methyl‐imidazolium ([EMIM]⁺), 1‐butyl‐2,3‐dimethyl‐imidazolium ([BM₂IM]⁺), and 1‐butyl‐1‐methyl‐pyrrolidinium ([BMPyr]⁺). The observed solvent effects can be attributed to an “anion effect”. The anion effect appears related to the anion size (polarizability) and their hydrogen‐bonding (HB) abilities to the substrate. These results have been confirmed by performing a comparison of the rate constants with Gutmann's donicity numbers (DNs). The good correlation between rate constants and DN emphasizes the major role of charge transfer from the anion to the substrate.     

具有四个素因子的奇亏完全数

设n为自然数,σ(n)表示n的所有正因子和函数.令d是n的真因子,若n满足σ(n)=2n-d,则称n为亏因子为d的亏完全数.本文给出了具有四个素因子的奇亏完全数的一些性质的刻画.     

Norms and lower bounds of some matrix operators on Fibonacci weighted difference sequence space

Norm of an operator T:X→Y is the best possible value of U satisfying the inequality and lower bound for T is the value of L satisfying the inequality where ‖.‖_X and ‖.‖_Y are the norms on the spaces X and Y, respectively. The main goal of this paper is to compute norms and lower bounds for some matrix operators from the weighted sequence space ?_p(w) into a new space called as Fibonacci weighted difference sequence space. For this purpose, we firstly introduce the Fibonacci difference matrix and the space consisting of sequences whose ‐transforms are in .